2048

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Dev119602 2048..2057

Tubes are essential for nutrient transport and gas exchange in multicellular eukaryotes, but how connections between different tube types are maintained over time is unknown. In the Drosophila tracheal system, mutations in oak gall (okg) and conjoined (cnj) confer identical defects, including late onset blockage near the terminal cell-stalk cell junction and the ectopic extension of autocellula...

متن کامل

Dmd058529 2041..2048

The coadministration of methotrexate (MTX) and proton pump inhibitors (PPIs) can result in a pharmacokinetic interaction that delays MTX elimination and subsequently increases the MTX blood concentrations. Human organic anion transporters (hOATs) are responsible for the renal tubular secretion of MTX and are thought to be involved in this drug interaction. The aim of this study was to evaluate ...

متن کامل

Deep Reinforcement Learning for 2048

In this paper, we explore the performance of a Reinforcement Learning algorithm using a Policy Neural Network to play the popular game 2048. After proposing a modelization of the state and action spaces, we review our learning process, and train a first model without incorporating any prior knwoledge of the game. We prove that a simple Probabilistic Policy Network achieves a 4 times higher maxi...

متن کامل

2048 is (PSPACE) Hard, but Sometimes Easy

We prove that a variant of 2048, a popular online puzzle game, is PSPACE-Complete. Our hardness result holds for a version of the problem where the player has oracle access to the computer player’s moves. Specifically, we show that for an n × n game board G, computing a sequence of moves to reach a particular configuration C from an initial configuration C0 is PSPACE-Complete. Our reduction is ...

متن کامل

2048 Without New Tiles Is Still Hard

We study the computational complexity of a variant of the popular 2048 game in which no new tiles are generated after each move. As usual, instances are defined on rectangular boards of arbitrary size. We consider the natural decision problems of achieving a given constant tile value, score or number of moves. We also consider approximating the maximum achievable value for these three objective...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Clinical and Translational Science

سال: 2017

ISSN: 2059-8661

DOI: 10.1017/cts.2017.55